Nested Sequents for Quantified Modal Logics

نویسندگان

چکیده

Abstract This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional logics definable by axioms D , T B 4 and 5 with varying, increasing, decreasing, constant domains. Each calculus is proved to have good structural properties: weakening contraction are height-preserving admissible cut (syntactically) admissible. shown be equivalent corresponding axiomatic system and, thus, sound complete. Finally, argued that calculi internal—i.e., each sequent has a formula interpretation—whenever existence predicate expressible in language.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Nested Sequents for Constructive Modal Logics

We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the standard modal logics K4, S4, and S5. We use for our presentation the formalism of nested sequents and give a syntactic proof of cut elimination.

متن کامل

Nested Sequents for Intuitionistic Modal Logics

We present cut-free deductive systems without labels for the intuitionistic variants of the modal logics obtained by extending K with a subset of the axioms d, t, b, 4, and 5. For this, we use the formalism of nested sequents. We show a uniform cut elimination argument and a terminating proof search procedure. As a corollary we get the decidability of all modal logics in the intuitionistic S5-c...

متن کامل

Cut Elimination in Nested Sequents for Intuitionistic Modal Logics

We present cut-free deductive systems without labels for the intuitionistic variants of the modal logics obtained by extending IK with a subset of the axioms d, t, b, 4, and 5. For this, we use the formalism of nested sequents, which allows us to give a uniform cut elimination argument for all 15 logic in the intuitionistic S5 cube.

متن کامل

Nested Sequents for Intuitionistic Logics

Nested sequent systems for modal logics were introduced by Kai Brünnler, and have come to be seen as an attractive deep reasoning extension of familiar sequent calculi. In an earlier paper I showed there was a connection between modal nested sequents and modal prefixed tableaus. In this paper I extend the nested sequent machinery to intuitionistic logic, both standard and constant domain, and r...

متن کامل

Modal interpolation via nested sequents

The main method of proving the Craig Interpolation Property (CIP) constructively uses cut-free sequent proof systems. Until now, however, no such method has been known for proving the CIP using more general sequent-like proof formalisms, such as hypersequents, nested sequents, and labelled sequents. In this paper, we start closing this gap by presenting an algorithm for proving the CIP for moda...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-43513-3_24